Dynamic Local Searchable Symmetric Encryption

In this article, we tackle for the first time problem of dynamic memory-efficient Searchable Symmetric Encryption (SSE). term “memory-efficient” SSE, encompass both goals local and page-efficient SSE. The centerpiece our approach is a novel connection between those two goals. We introduce map, called Generic Local Transform, which takes as input SSE scheme with certain special features, outputs an strong locality properties. obtain several results. (1) First, page size p, build storage efficiency $$\mathcal {O}({1})$$ $$\widetilde{\mathcal {O}}\left( {\textrm{log}\, \textrm{log}\, (N/p)}\right) $$ , $$\textsf{LayeredSSE}$$ . main technical innovation behind weighted extension two-choice allocation process, independent interest. (2) Second, combine it to read {\textrm{log}\,\textrm{log}\, N}\right) under condition that longest list {O}({N^{1-1/\textrm{log}\, \lambda }})$$ This matches, in every respect, purely static construction Asharov et al. presented at STOC 2016: dynamism comes no extra cost. (3) Finally, by applying Transform variant Tethys Bossuat from Crypto 2021, unconditional {O}({\textrm{log}^\varepsilon N})$$ arbitrarily small constant $$\varepsilon > 0$$ To knowledge, closest lower bound Cash Tessaro Eurocrypt 2014.